A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays

This paper considers the minimization of makespan for a set dependent tasks with unit duration and communication delays. Given an upper bound makespan, release dates deadlines can be computed. Time windows are defined accordingly. We prove that our scheduling problem is fixed-parameter tractable; parameter maximum number schedulable at same time considering windows.A algorithm based on dynamic programming approach developed proved to solve this optimization problem. is, as far we know, first